Branch and Bound for Negotiations in Large Agreement Spaces

We introduce a new multiagent negotiation algorithm for large and complex domains, called NB3. It applies Branch & Bound to search for good offers to propose. To analyze its performance we present a new problem called the Negotiating Salesmen Problem. We have conducted some experiments with NB3 from which we conclude that it manages to decrease the traveling cost of the agents significantly, that it outperforms random search and that it scales well with the complexity of the problem. Source URL: https://www.iiia.csic.es/en/node/54531 Links [1] https://www.iiia.csic.es/en/staff/dave-de-jonge [2] https://www.iiia.csic.es/en/staff/carles-sierra [3] https://www.iiia.csic.es/en/bibliography?f[author]=736 [4] https://www.iiia.csic.es/en/bibliography?f[author]=737 [5] https://www.iiia.csic.es/en/bibliography?f[keyword]=582 [6] https://www.iiia.csic.es/en/bibliography?f[keyword]=526 [7] https://www.iiia.csic.es/en/bibliography?f[keyword]=481 [8] https://www.iiia.csic.es/en/bibliography?f[keyword]=525